On Pairwise Spanners

Given an undirected n-node unweighted graph G = (V,E), a spanner with stretch function f(·) is a subgraph H ⊆ G such that, if two nodes are at distance d in G, then they are at distance at most f(d) in H. Spanners are very well studied in the literature. The typical goal is to construct the sparsest possible spanner for a given stretch function. In this paper we study pairwise spanners, where we require to approximate the u-v distance only for pairs (u, v) in a given set P ⊆ V × V . Such P-spanners were studied before [Coppersmith,Elkin’05] only in the special case that f(·) is the identity function, i.e. distances between relevant pairs must be preserved exactly (a.k.a. pairwise preservers). Here we present pairwise spanners which are at the same time sparser than the best known preservers (on the same P) and of the best known spanners (with the same f(·)). In more detail, for arbitrary P, we show that there exists a P-spanner of size O(n(|P| logn)1/4) with f(d) = d+4 logn. Alternatively, for any ε > 0, there exists a P-spanner of size O(n|P|1/4 √ logn ε ) with f(d) = (1 + ε)d+ 4. We also consider the relevant special case that there is a critical set of nodes S ⊆ V , and we wish to approximate either the distances within nodes in S or from nodes in S to any other node. We show that there exists an (S × S)-spanner of size O(n √ |S|) with f(d) = d + 2, and an (S × V )-spanner of size O(n √ |S| logn) with f(d) = d + 2 logn. All the mentioned pairwise spanners can be constructed in polynomial time. 1998 ACM Subject Classification G.2.2 Graphs Algorithms